On the Hamiltonian and Classification Problems for some Families of Split Graphs

نویسنده

  • Ngo Dac Tan
چکیده

A graph G = (V,E) is called a split graph if there exists a partition V = I ∪K such that the subgraphs G[I ] and G[K] of G induced by I and K are empty and complete graphs, respectively. In this paper, we survey results on the hamiltonian and classification problems for split graphs G with the minimum degree δ(G) ≥ |I | − 4. 2000 Mathematics Subject Classification: 05C45, 05C75.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric-Arithmetic Index of Hamiltonian Fullerenes

A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.

متن کامل

On Fixed Point Results for Hemicontractive-type Multi-valued Mapping, Finite Families of Split Equilibrium and Variational Inequality Problems

In this article, we introduced an iterative scheme for finding a common element of the set of fixed points of a multi-valued hemicontractive-type mapping, the set of common solutions of a finite family of split equilibrium problems and the set of common solutions of a finite family of variational inequality problems in real Hilbert spaces. Moreover, the sequence generated by the proposed algori...

متن کامل

Constructions of antimagic labelings for some families of regular graphs

In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

متن کامل

Symplectic and symmetric methods for the numerical solution of some mathematical models of celestial objects

In the last years, the theory of numerical methods for system of non-stiff and stiff ordinary differential equations has reached a certain maturity. So, there are many excellent codes which are based on Runge–Kutta methods, linear multistep methods, Obreshkov methods, hybrid methods or general linear methods. Although these methods have good accuracy and desirable stability properties such as A...

متن کامل

$Z_k$-Magic Labeling of Some Families of Graphs

For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic}  if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$  defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$  the group of integers modulo $k...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009